Non-monotonic Properties for Proving Correctness in a Framework of Compositional Logic
نویسندگان
چکیده
Following up our previous work [9], we distinguish the monotonic properties and the non-monotonic ones in our inference system based on the framework of compositional logic, and give the way to include some non-monotonic properties. As an example, we present a correctness proof of Challenge Response protocol, and explain how such properties can be used in more powerful derivations. We also give a semantics based on the notion of trace, and present a soundness proof of our inference system including non-monotonic properties.
منابع مشابه
A Generic Logic for Proving Linearizability
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated wi...
متن کاملA Generic Logic for Proving Linearizability (Extended Version)
Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated wi...
متن کاملCompositional Model Checking of Partially Ordered State Spaces
Symbolic trajectory evaluation (STE) — a model checking technique based on partial orderrepresentations of state spaces — has been shown to be an effective model checking techniquefor large circuit models. However, the temporal logic that it supports is restricted, and as with allverification techniques has significant performance limitations. The demand for verifying largercirc...
متن کاملFormally Verifiable Networking
This paper proposes Formally Verifiable Networking (FVN), a novel approach towards unifying the design, specification, implementation, and verification of networking protocols within a logic-based framework. In FVN, formal logical statements are used to specify the behavior and the properties of the protocol. FVN uses declarative networking as an intermediary layer between high-level logical sp...
متن کاملIntegrating LTL Model Checking with Automated Theorem Proving
Theorem proving is a general-purpose veriication technique that typically needs to be guided by human insight whereas model checking works in the more constrained domain of essentially nite-state systems but is largely automatic. There are several advantages to integrating the two techniques since theorem proving can be used to compose proofs where individual steps or lemmas have been veriied u...
متن کامل